Analysis and Generation of Pseudo-Industrial MaxSAT Instances
نویسندگان
چکیده
We propose two random generation models for MaxSAT and Partial MaxSAT in order to produce instances more similar to the industrial benchmarks used in the MaxSAT evaluation. Following the work of [4] and [2], we analyze properties of industrial instances and use a non-uniform (powerlaw) distribution to select the variables. We also study empirically the optimum (minim number of unsatisfiable clauses) that we obtain with these models, and the relative performance of some MaxSAT solvers. We observe that industrial specialized MaxSAT solvers are better on these random formulas than random specialized solvers. We conclude that instances generated with these new models are more similar to industrial instances than the generated with the classical random models based on uniform probability distributions.
منابع مشابه
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
In recent years, unsatisfiability-based algorithms have become prevalent as state of the art for solving industrial instances of Maximum Satisfiability (MaxSAT). These algorithms perform a succession of unsatisfiable SAT solver calls until an optimal solution is found. In several of these algorithms, cardinality or pseudo-Boolean constraints are extended between iterations. However, in most cas...
متن کاملAnalyzing the Instances of the MaxSAT Evaluation
The MaxSAT Evaluation [1] is an affiliated event of the SAT Conference that is held every year since 2006, and is devoted to empirically evaluate exact MaxSAT algorithms solving any of the following problems: MaxSAT, Weighted MaxSAT (WMaxSAT), Partial MaxSAT (PMaxSAT), and Weighted Partial MaxSAT (WPMaxSAT). The objective of this paper is to analyze the instances of the 2010 MaxSAT Evaluation i...
متن کاملExploiting the Structure of Unsatisfiable Cores in MaxSAT
We propose a new approach that exploits the good properties of core-guided and model-guided MaxSAT solvers. In particular, we show how to effectively exploit the structure of unsatisfiable cores in MaxSAT instances. Experimental results on industrial instances show that the proposed approach outperforms both complete and incomplete stateof-the-art MaxSAT solvers at the last international MaxSAT...
متن کاملImproving WPM2 for (Weighted) Partial MaxSAT
Weighted Partial MaxSAT (WPMS) is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper we extend the state-of-the-art WPM2 algorithm by adding several improvements, and implement it on top of an SMT solver. In particular, we show that by focusing search on solving to optimality subformulas of the orig...
متن کاملExploiting subproblem optimization in SAT-based MaxSAT algorithms
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into a MaxSAT formula. Among exact MaxSAT algorithms, SAT-based MaxSAT algorithms are the best performing approaches for real-world problems. We have extended the WPM2 algorithm by adding several improvements. In particular, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012